package com.interview.array;

import java.util.Arrays;
import java.util.Scanner;

public class ArraysSort {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        System.out.println("How many numbers do you need to draw");
        int k = in.nextInt();

        System.out.println("What is the hightest number you can draw?");
        int n = in.nextInt();

        int[] numbers = new int[n];
        for (int i = 0; i <numbers.length; i++)
            numbers[i] = i + 1;

        int[] result = new int[k];
        for (int i = 0; i < result.length; i++) {
            int r = (int) (Math.random() * n);

            result[i] = numbers[r];
            numbers[r] = numbers[n - 1];
            n--;
        }
        for(int r:result){
            System.out.println(r);
        }
        Arrays.sort(result);//sort采用优化的快速排序算法对数组进行排序
        System.out.println("Bet the fllowing combination. It'll make you rich");
        for(int r:result){
            System.out.println(r);
        }
    }
}
